Two decidability results for deterministic pushdown automata
نویسندگان
چکیده
منابع مشابه
Height-Deterministic Pushdown Automata
We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on the input are a priori fixed. Different subclasses of height-deterministic pushdown automata, strictly containing the class of regular languages and still closed under boolean language operations, are considered. Several such lan...
متن کاملDeterministic Frequency Pushdown Automata
A set L is (m,n)-computable iff there is a mechanism which on input of n different words produces n conjectures whether these words are in L, respectively, such that at least m of these conjectures are right. Prior studies dealt with (m,n)computable sets in the contexts of recursion theory, complexity theory and the theory of finite automata. The present work aims to do this with respect to com...
متن کاملDeciding Equivalence of Deterministic Pushdown Automata
Deterministic pushdown automata (DPDA) are a class of simple yet powerful models of computation. It has a finite set of states and a (pushdown) stack. Depending on the current state, the symbol at the top of the stack, and the symbol of the input word that has just been scanned, the automaton moves to a new state, either pushes or pops a symbol on the stack, and it is ready to scan the next sym...
متن کاملMonadic Quantifiers Recognized by Deterministic Pushdown Automata
I characterize the class of type 〈1〉 quantifiers (or, equivalently, type 〈1, 1〉 quantifiers satisfying Conservativity and Extension) that are recognized by deterministic pushdown automata in terms of the associated semilinear sets of vectors in N. These semilinear sets are finite unions of linear sets with at most two generators each, which are taken from a common three-element set of the form ...
متن کاملDeterministic Pushdown Automata and Unary Languages
The simulation of deterministic pushdown automata defined over a one-letter alphabet by finite state automata is investigated from a descriptional complexity point of view. We show that each unary deterministic pushdown automaton of size s can be simulated by a deterministic finite automaton with a number of states that is exponential in s. We prove that this simulation is tight. Furthermore, i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1979
ISSN: 0022-0000
DOI: 10.1016/0022-0000(79)90055-2